Inverting operations in operads
نویسندگان
چکیده
منابع مشابه
Inverting Operations in Operads
We construct a localization for operads with respect to one-ary operations based on the Dwyer-Kan hammock localization [2]. For an operad O and a sub-monoid of one-ary operations W we associate an operad LO and a canonical map O → LO which takes elements in W to homotopy invertible operations. Furthermore, we give a functor from the category of O-algebras to the category of LO-algebras satisfyi...
متن کاملCohomology Operations and Inverting the Motivic Bott Element
In this note we explore the relationships between the motivic cohomology operations and the (classical) cohomology operations defined on mod-l étale cohomology. More precisely we show that the cohomology operations on motivic cohomology transform to the (classical) cohomology operations on mod-l étale cohomology upon inverting the motivic Bott element.
متن کاملOperads in algebraic combinatorics
The main ideas developed in this habilitation thesis consist in endowing combinatorial objects (words, permutations, trees, Young tableaux, etc.) with operations in order to construct algebraic structures. This process allows, by studying algebraically the structures thus obtained (changes of bases, generating sets, presentations, morphisms, representations), to collect combinatorial informatio...
متن کاملOperads of Natural Operations I: Lattice Paths, Braces and Hochschild Cochains
— In this first paper of a series we study various operads of natural operations on Hochschild cochains and relationships between them. Résumé (Opérades des opérations naturelles I: chemins brisés, opérations braces et cochaînes de Hochschild) Dans ce premier article d’une série nous étudions et comparons plusieurs opérades munies d’une action naturelle sur les cochaines de Hochschild d’une alg...
متن کاملColored operads, series on colored operads, and combinatorial generating systems
A new sort of combinatorial generating system, called bud generating system, is introduced. Bud generating systems are devices for specifying sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing to work with all these generating systems in a unified way. The theory of bud generating sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2018
ISSN: 0166-8641
DOI: 10.1016/j.topol.2017.12.011